Specifying Diagram Languages by Means of Hypergraph Grammars
نویسنده
چکیده
For working with diagrams on a computer screen we need diagram editors, i.e., graphical editors specialized in the specific diagram language. In order to create such a diagram editor in a methodical way, a formal representation of each diagram and of the whole diagram language is required. This paper describes continued work on how to specify a wide range of diagram languages in terms of a hypergraph model together with hypergraph grammars. The specification of a diagram language can serve as input for an automated generator which creates a diagram editor for the specified diagram language. Editors support syntax-directed editing as well as free hand editing of the diagrams on the screen which are internally represented by hypergraphs. For free hand editing, a hypergraph parser is used to obtain the diagrams’ syntactic structure and to distinguish correct diagrams or diagram parts from incorrect ones.
منابع مشابه
Specifying Animated Diagram Languages
Diagrams are always used when communicating complex situations. As a special case, dynamic processes like the token game in Petri-nets are made clear using dynamic diagrams. Animation techniques have to be used in order to achieve a comprehensible visualization. The paper discusses dynamic diagram languages with animations, i.e., animated diagram languages, and how to specify them. Specificatio...
متن کاملXML-based Specification of Diagram Editors
This paper describes a graphical specification tool for DiaGen, a diagram editor generator based on hypergraph grammars and hypergraph transformation. The specification tool greatly simplifies the process of specifying and generating diagram editors. It uses an XML-based specification language, and it is an extension of a generic XML editor which offers syntax-directed editing based on the DTD,...
متن کاملContraction of Unconnected Diagrams using Least Cost Parsing
A free-hand diagram editor allows the user to place diagram components on the pane without any restrictions. This increase in flexibility often comes at the cost of editing performance, though. In particular it is tedious to manually establish the spatial relations between diagram components that are required by the visual language. Even worse are certain graph-like languages where it is a quit...
متن کاملContextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages
In this paper, we introduce contextual hypergraph grammars, which generalize the total contextual string grammars. We study the position of the class of languages generated by contextual hypergraph grammars in comparison with graph languages generated by hyperedge replacement grammars and double-pushout hypergraph grammars. Moreover, several examples show the potential of the new class of gramm...
متن کاملAn Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
The algorithm of Cocke, Younger, and Kasami is a dynamic programming technique well-known from string parsing. It has been adopted to hypergraphs successfully by Lautemann. Therewith, many practically relevant hypergraph languages generated by hyperedge replacement can be parsed in an acceptable time. In this paper we extend this algorithm by hypergraph completion: If necessary, appropriate fre...
متن کامل